package algorithm

func mergeSort(arr []int, first, end int) {
	if first < end {
		mid := (first + end) / 2
		mergeSort(arr, first, mid)
		mergeSort(arr, mid+1, end)
		// merge(arr, first, end, mid)
	}
}

// func merge(arr []int,first,end,mid int){

// }
